Matching polynomial

Results: 35



#Item
21NP-complete problems / Combinatorial optimization / Vertex cover / Approximation algorithm / Matching / Algorithm / Linear programming / Polynomial-time approximation scheme / Maximum cut / Theoretical computer science / Mathematics / Applied mathematics

SODA15 – Accepted Papers Martin Skutella A note on the ring loading problem Marco Di Summa, Friedrich Eisenbrand, Yuri Faenza and Carsten Moldenhauer. On largest volume simplices and sub-determinants Seth Pettie

Add to Reading List

Source URL: www.siam.org

Language: English - Date: 2014-10-08 09:27:53
22NP-complete problems / Combinatorial optimization / Vertex cover / Approximation algorithm / Matching / Algorithm / Linear programming / Polynomial-time approximation scheme / Maximum cut / Theoretical computer science / Mathematics / Applied mathematics

SODA15 – Accepted Papers Martin Skutella A note on the ring loading problem Marco Di Summa, Friedrich Eisenbrand, Yuri Faenza and Carsten Moldenhauer. On largest volume simplices and sub-determinants Seth Pettie

Add to Reading List

Source URL: www.siam.org

Language: English - Date: 2014-10-08 09:27:53
23Matroid theory / Matching / Graph coloring / Tutte polynomial / Chromatic polynomial / Matching polynomial / Graph property / Tree decomposition / Schwartz–Zippel lemma / Graph theory / Mathematics / Polynomials

The Multivariate Ising Polynomial of a Graph Daniel Andr´en and Klas Markstr¨ om Abstract. In this paper we discuss the two variable Ising polynomial in a graph theoretical setting. This polynomial has its origin in ph

Add to Reading List

Source URL: abel.math.umu.se

Language: English - Date: 2013-12-11 09:07:22
24Combinatorics / Algebraic combinatorics / Sage / Discrete mathematics / Magma computer algebra system / KAIST / Matching polynomial / Orthogonal polynomials / Charles Hermite / Mathematics / Software / Mathematical software

Dan Drake Visiting Professor KAIST Department of Mathematical Sciences Daejeon, Korea T +[removed]

Add to Reading List

Source URL: mathsci.kaist.ac.kr

Language: English - Date: 2012-01-03 21:53:35
25Clique / Graph / Matching / Matroid theory / Graph operations / Tutte polynomial / Graph theory / Mathematics / Neighbourhood

Robust Graph Mode Seeking by Graph Shift

Add to Reading List

Source URL: www.icml2010.org

Language: English - Date: 2010-06-13 09:06:36
26Combinatorial optimization / Matching / Planar graph / Structure / Vertex cover / Holographic algorithm / Tutte polynomial / Robertson–Seymour theorem / Graph theory / Mathematics / Theoretical computer science

Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP Jin-Yi Cai∗ Pinyan Lu†

Add to Reading List

Source URL: pages.cs.wisc.edu

Language: English - Date: 2010-07-10 15:34:42
27Combinatorial optimization / Matching / Bipartite graph / Planar graphs / Graph / FKT algorithm / Tutte polynomial / Graph theory / Mathematics / Computational problems

Some Results on Matchgates and Holographic Algorithms Jin-Yi Cai Vinay Choudhary

Add to Reading List

Source URL: pages.cs.wisc.edu

Language: English - Date: 2006-09-29 00:40:45
28FKT algorithm / Computational problems / Pfaffian / Matching / Minor / Adjacency matrix / Planarity / Tutte polynomial / Tree decomposition / Graph theory / Mathematics / Planar graphs

Some Results on Matchgates and Holographic Algorithms Jin-Yi Cai 1 Vinay Choudhary 2 Computer Sciences Department University of Wisconsin Madison, WI[removed]USA.

Add to Reading List

Source URL: pages.cs.wisc.edu

Language: English - Date: 2006-02-12 22:13:48
29Cryptographic protocols / Computational complexity theory / IP / Homomorphic encryption / Paillier cryptosystem / Communication complexity / One-way function / Polynomial / Oblivious transfer / Cryptography / Theoretical computer science / Applied mathematics

Efficient Private Matching and Set Intersection Michael J. Freedman1? , Kobbi Nissim2?? , and Benny Pinkas3 1 2

Add to Reading List

Source URL: www.pinkas.net

Language: English - Date: 2004-05-12 12:29:04
30Graph coloring / Matroid theory / Polynomials / Tutte polynomial / Connectivity / Matching / K-edge-connected graph / Chromatic polynomial / Randomized algorithm / Graph theory / Mathematics / Theoretical computer science

Sparse Reliable Graph Backbones Shiri Chechik Department of Computer Science and Applied Mathematics Weizmann Institute of Science Rehovot 76100, Israel Yuval Emek

Add to Reading List

Source URL: www.tik.ee.ethz.ch

Language: English - Date: 2013-05-02 13:59:19
UPDATE